KEIM: A Toolkit for Automated Deduction
نویسندگان
چکیده
منابع مشابه
A Proof Environment for the Development of Group Communication Systems
C. & H. Kirchner, ed. 15 International Conference on Automated Deduction (CADE-15), LNAI 1421, pp. 317–331, c ©Springer Verlag, 1998. Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction applicable to the implementation of real-world systems by linking the Ensemble group co...
متن کاملThe SAD System: a Current State and Future Work
The purpose of this communication is to outline briefly the current state of the so-called SAD system (System for Automated Deduction), present its architecture, and discus some possible ways of its further development. At that, the main attention is paid to the development of multiple language support of the SAD system as well as to the construction of SAD proof search methods, toolkit, and en...
متن کاملCan Refinement be Automated?
We automatically verify Back’s atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on Kleene algebras in an off the shelf resolution and paramodulation theorem prover and a counterexample checker with heuristics for hypothesis learning. The proofs are supported by a toolkit of meaningful refinement laws that ...
متن کاملProvenance for Explaining Taxonomy Alignments
Derivations and proofs are a form of provenance in automated deduction that can assist users in understanding how reasoners derive logical consequences from premises. However, system-generated proofs are often overly complex or detailed, and making sense of them is non-trivial. Conversely, without any form of provenance, it is just as hard to know why a certain fact was derived. We study proven...
متن کاملHandling Polymorphism in Automated Deduction
Polymorphism has become a common way of designing short and reusable programs by abstracting generic definitions from typespecific ones. Such a convenience is valuable in logic as well, because it unburdens the specifier from writing redundant declarations of logical symbols. However, top shelf automated theorem provers such as Simplify, Yices or other SMT-LIB ones do not handle polymorphism. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994